On the Semantics of Markov Automata
نویسندگان
چکیده
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between such systems, a generalisation of reduction barbed congruence, the well-known touchstone equivalence for a large variety of process description languages.3
منابع مشابه
Detection and prediction of land use/ land cover changes using Markov chain model and Cellular Automata (CA-Markov), (Case study: Darab plain)
unprincipled changes in land use are major challenges for many countries and different regions of the world, which in turn have devastating effects on natural resources, Therefore, the study of land-use changes has a fundamental and important role for environmental studies. The purpose of this study is to detect and predicting of land use/ land cover (LULC) changes in Darab plain through the Ma...
متن کاملSimulation of Future Land Use Map of the Catchment Area, with the Integration of Cellular Automata and Markov Chain Models Based on Selection of the Best Classification Algorithm: A Case Study of Fakhrabad Basin of Mehriz, Yazd
INTRODUCTION Since the land use change affects many natural processes including soil erosion and sediment yield, floods and soil degradation and the chemical and physical properties of soil, so, different aspects of land use changes in the past and future should be considered particularly in the planning and decision-making. One of the most important applications of remote sensing is land ...
متن کاملUtilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs
Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...
متن کاملA Decidable Probability Logic for Timed and Untimed Probabilistic Systems
In this paper we extend the predicate logic introduced in [BRS02] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to Semi-Markov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering also predicates on...
متن کاملA Decidable Probability Logic for Timed Probabilistic Systems
In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to SemiMarkov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering als...
متن کاملIntegrating cellular automata Markov model to simulate future land use change of a tropical basin
Predicting land use change is an indispensable aspect in identifying the best development and management of land resources and their potential. This study used certified land-use maps of 1997, 2006, and 2015 combined with ancillary data such as road networks, water bodies and slopes, obtained from the Department of Agriculture and the Department of Surveying and Mapping in Malaysia, respectivel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011